Diffie–Hellman problem - PDFSEARCH.IO - Document Search Engine

Diffie–Hellman problem
Results: 86

#	Item
71	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme Giuseppe Ateniese1 , Jan Camenisch2 , Marc Joye3 , and Gene Tsudik4 Add to Reading List Source URL: www.zurich.ibm.com Language: English - Date: 2000-10-24 11:52:18 Finite fields Cryptographic protocols Group signature Diffie–Hellman key exchange Digital signature Computational Diffie–Hellman assumption ElGamal encryption Diffie–Hellman problem Schnorr signature Cryptography Computational hardness assumptions Public-key cryptography
72	Strongly-Secure Identity-based Key Agreement and Anonymous Extension Sherman S.M. Chow1 and Kim-Kwang Raymond Choo2, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-01-03 02:55:34 Key-agreement protocol MQV Public-key cryptography XTR Computational Diffie–Hellman assumption Advantage Perfect forward secrecy Diffie–Hellman problem Ciphertext indistinguishability Cryptography Cryptographic protocols Diffie–Hellman key exchange
73	A Security Analysis of the NIST SP[removed]Elliptic Curve Random Number Generator Daniel R. L. Brown∗ and Kristian Gjøsteen† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-02-15 14:36:16 Elliptic curve XTR Diffie–Hellman problem Logarithm Prime number Supersingular elliptic curve Homomorphic signatures for network coding Lenstra elliptic curve factorization Abstract algebra Finite fields Mathematics
74	Number field cryptography Johannes Buchmann Add to Reading List Source URL: www.cdc.informatik.tu-darmstadt.de Language: English - Date: 2004-02-18 05:25:39 Finite fields Computational hardness assumptions Algebraic number theory Cryptographic protocols Field theory Diffie–Hellman problem Quadratic field Discrete logarithm XTR Abstract algebra Mathematics Algebra
75	In Advances in Cryptology—Asiacrypt’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]Doing More with Fewer Bits Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2000-02-21 14:17:00 Public-key cryptography Diffie–Hellman key exchange ElGamal encryption Diffie–Hellman problem Polynomial RSA Prime number XTR Elliptic curve Diffie–Hellman Cryptography Cryptographic protocols Finite fields
76	In Advances in Cryptology—CRYPTO ’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]A Simple Publicly Verifiable Secret Sharing Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2001-04-03 10:12:09 Public-key cryptography Publicly Verifiable Secret Sharing Finite fields Verifiable secret sharing Secret sharing ElGamal encryption Diffie–Hellman key exchange Diffie–Hellman problem Decisional Diffie–Hellman assumption Cryptography Cryptographic protocols Computational hardness assumptions
77	Short Signature Scheme From Bilinear Pairings Sedat Akleylek , Barı¸s B¨ ulent Kırlar Add to Reading List Source URL: events.iaik.tugraz.at Language: English - Date: 2009-06-09 04:23:16 Diffie–Hellman problem Group signature Digital signature ID-based encryption Weil pairing Pairing RSA Diffie–Hellman key exchange Public-key cryptography Cryptography BLS Pairing-based cryptography
78	Workshop on Selected Areas in Cryptography[removed] – 16 august 2002, St. John’s, Newfoundland, Canada) H. Heys and K. Nyberg Eds. Springer-Verlag, LNCS 2595, pages 325–338 Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2007-07-06 16:33:16 Finite fields Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Hellman ElGamal encryption Whitfield Diffie XDH assumption Cryptography Computational hardness assumptions Cryptographic protocols
79	Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:10:57 Finite fields Logarithms Computational hardness assumptions Group theory XTR Discrete logarithm Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm records Abstract algebra Mathematics Cryptography
80	PDF Document Add to Reading List Source URL: www.msri.org Language: English - Date: 2004-04-09 16:58:07 Computational hardness assumptions Electronic commerce RSA Cryptographic protocols Leonard Adleman Adi Shamir Diffie–Hellman problem Ron Rivest Cipher Cryptography Public-key cryptography Turing Award laureates

UPDATE